Generalized packing designs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized packing designs

Generalized t-designs, which form a common generalization of objects such as tdesigns, resolvable designs and orthogonal arrays, were defined by Cameron [P.J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835–4842]. In this paper, we define a related class of combinatorial designs which simultaneously generalize packing designs and packing arrays. We describe the sometimes...

متن کامل

Packing of partial designs

We say that two hypergraphs H1 and H2 with v vertices each can be packed if there are edge disjoint hypergraphs H ′ 1 and H ′ 2 on the same set V of v vertices, where H ′ i is isomorphic to Hi. It is shown that for every fixed integers k and t, where t ≤ k ≤ 2t − 2 and for all sufficiently large v there are two (t, k, v) partial designs that cannot be packed. Moreover, there are two isomorphic ...

متن کامل

Generalized selfish bin packing

Standard bin packing is the problem of partitioning a set of items with positive sizes no larger than 1 into a minimum number of subsets (called bins) each having a total size of at most 1. In bin packing games, an item has a positive weight, and given a valid packing or partition of the items, each item has a cost or a payoff associated with it. We study a class of bin packing games where the ...

متن کامل

Generalized Bin Packing Problems

Original Citation: Baldi M.M. Generalized Bin Packing Problems. In: 4OR. ISSN 1619-4500 (In Press) Availability: This version is available at : http://porto.polito.it/2523486/ since: December 2013 Publisher: Springer Published version: DOI:10.1007/s10288-013-0252-1 Terms of use: This article is made available under terms and conditions applicable to Open Access Policy Article ("Public All right...

متن کامل

Embeddings of canonical Kirkman packing designs

For a given positive integer v with v ≡ 4(mod 6) and v > 4, let CKPD(v) denote a canonical Kirkman packing design of order v. It is proved in this paper that any CKPD(v) can be embedded in a CKPD(u) if u ≡ v ≡ 4 (mod 6), v ≥ 82 and u ≥ 3.5v.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2013

ISSN: 0012-365X

DOI: 10.1016/j.disc.2011.11.039